Nonvanishing of the partition function modulo small primes
نویسندگان
چکیده
منابع مشابه
Distribution of the partition function modulo
and he conjectured further such congruences modulo arbitrary powers of 5, 7, and 11. Although the work of A. O. L. Atkin and G. N. Watson settled these conjectures many years ago, the congruences have continued to attract much attention. For example, subsequent works by G. Andrews, A. O. L. Atkin, F. Garvan, D. Kim, D. Stanton, and H. P. F. Swinnerton-Dyer ([An-G], [G], [G-K-S], [At-Sw2]), in t...
متن کاملSolving Equations of Small Degree modulo Large Primes
Atkin's algorithm [11] requires nding roots of polynomials modulo large primes (several hundreds decimal digits). However, the theory tells us that these polynomials split completely in the eld Z=pZ we are interested in. The most straightforward approach is to use the probabilistic algorithm of Berlekamp (the \folk method" as described in [8]). In the general case, this method carries out a dis...
متن کاملDistribution of the Partition Function modulo Composite Integers M
seem to be distinguished by the fact that they are exceptionally rare. Recently, Ono [O1] has gone some way towards quantifying the latter assertion. More recently, Ono [O2] has made great progress on the complementary question. Namely, he proves that if M ≥ 5 is prime, then there are in fact infinitely many congruences of the form (1.1). Using the ideas in [O2], Weaver [We] has recorded over 7...
متن کاملPeriods of Orbits modulo Primes
Let S be a monoid of endomorphisms of a quasiprojective variety V defined over a global field K. We prove a lower bound for the size of the reduction modulo places of K of the orbit of any point α ∈ V (K) under the action of the endomorphisms from S. We also prove a similar result in the context of Drinfeld modules. Our results may be considered as dynamical variants of Artin’s primitive root c...
متن کاملSome Curious Congruences modulo Primes
Let n be a positive odd integer and let p > n + 1 be a prime. We mainly derive the following congruence: ∑ 0<i1<···<in<p ( i1 3 ) (−1)i1 i1 · · · in ≡ 0 (mod p).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2006
ISSN: 1073-7928,1687-0247
DOI: 10.1155/imrn/2006/46120